- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
40000
- Availability
-
40
- Author / Contributor
- Filter by Author / Creator
-
-
Woodruff, David P. (3)
-
Chepurko, Nadiia (2)
-
Clarkson, Kenneth L. (2)
-
Bakshi, Ainesh (1)
-
Boratko, Michael (1)
-
Clarkson, Kenneth (1)
-
Clarkson, Kenneth L (1)
-
Horesh, Lior (1)
-
Kacham, Praneeth (1)
-
Lin, Honghao (1)
-
McCallum, Andrew (1)
-
Monath, Nicholas (1)
-
Vilnis, Luke (1)
-
Zhang, Dongxu (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
- (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Chepurko, Nadiia ; Clarkson, Kenneth ; Kacham, Praneeth ; Woodruff, David P. ( , Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms)
-
Chepurko, Nadiia ; Clarkson, Kenneth L. ; Horesh, Lior ; Lin, Honghao ; Woodruff, David P. ( , ICML)
-
Boratko, Michael ; Zhang, Dongxu ; Monath, Nicholas ; Vilnis, Luke ; Clarkson, Kenneth L ; McCallum, Andrew ( , NeurIPS 2021)A wide variety of machine learning tasks such as knowledge base completion, ontology alignment, and multi-label classification can benefit from incorporating into learning differentiable representations of graphs or taxonomies. While vectors in Euclidean space can theoretically represent any graph, much recent work shows that alternatives such as complex, hyperbolic, order, or box embeddings have geometric properties better suited to modeling real-world graphs. Experimentally these gains are seen only in lower dimensions, however, with performance benefits diminishing in higher dimensions. In this work, we introduce a novel variant of box embeddings that uses a learned smoothing parameter to achieve better representational capacity than vector models in low dimensions, while also avoiding performance saturation common to other geometric models in high dimensions. Further, we present theoretical results that prove box embeddings can represent any DAG. We perform rigorous empirical evaluations of vector, hyperbolic, and region-based geometric representations on several families of synthetic and real-world directed graphs. Analysis of these results exposes correlations between different families of graphs, graph characteristics, model size, and embedding geometry, providing useful insights into the inductive biases of various differentiable graph representations.more » « less